Nonsingularity under data rounding

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal rounding under integer constraints

Given N real numbers whose sum is an integer, we study the problem of finding N integers which match these real numbers as closely as possible, in the sense of Lp norm, while preserving the sum. We describe the structure of solutions for this integer optimization problem and propose an algorithm with complexity O(N logN) for solving it. In contrast to fractional rounding and randomized rounding...

متن کامل

Analytic Functions and Nonsingularity

We will show that every nonsingular complex variety is a manifold in the analytic topology, but we wish to show more – that it has the natural structure of a complex manifold. In order to do this, we will need to introduce additional structure on the analytic topology. To allow for singular points, we give a definition more general than that of complex manifolds, mimicking our definitions from ...

متن کامل

Checking nonsingularity of tridiagonal matrices

I. Bar-On, B. Codenotti, and M. Leoncini presented a linear time algorithm for checking the nonsingularity of general tridiagonal matrices [BIT, 36:206, 1996]. A detailed implementation of their algorithm, with some extensions to possibly reducible matrices, is further described in the present paper.

متن کامل

Ellipsoidal rounding for nonnegative matrix factorization under noisy separability

We present a numerical algorithm for nonnegative matrix factorization (NMF) problems under noisy separability. An NMF problem under separability can be stated as one of finding all vertices of the convex hull of data points. The research interest of this paper is to find the vectors as close to the vertices as possible in a situation in which noise is added to the data points. Our algorithm is ...

متن کامل

Ray Patterns of Matrices and Nonsingularity

A complex matrix A is ray-nonsingular if det(X 0 A) f 0 for every matrix X with positive entries. A sufficient condition for ray nonsingularity is that the origin is not in the relative interior of the convex hull of the signed transversal products of A. The concept of an isolated set of transversals is defined and used to obtain a neces*Work supported by an NSERC research grant. LINEAR ALGEBRA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1990

ISSN: 0024-3795

DOI: 10.1016/0024-3795(90)90396-t